90 research outputs found
A Fast Approach to Creative Telescoping
In this note we reinvestigate the task of computing creative telescoping
relations in differential-difference operator algebras. Our approach is based
on an ansatz that explicitly includes the denominators of the delta parts. We
contribute several ideas of how to make an implementation of this approach
reasonably fast and provide such an implementation. A selection of examples
shows that it can be superior to existing methods by a large factor.Comment: 9 pages, 1 table, final version as it appeared in the journa
Lower bounds on the number of realizations of rigid graphs
Computing the number of realizations of a minimally rigid graph is a
notoriously difficult problem. Towards this goal, for graphs that are minimally
rigid in the plane, we take advantage of a recently published algorithm, which
is the fastest available method, although its complexity is still exponential.
Combining computational results with the theory of constructing new rigid
graphs by gluing, we give a new lower bound on the maximal possible number of
(complex) realizations for graphs with a given number of vertices. We extend
these ideas to rigid graphs in three dimensions and we derive similar lower
bounds, by exploiting data from extensive Gr\"obner basis computations
Proof of George Andrews's and David Robbins's q-TSPP Conjecture
The conjecture that the orbit-counting generating function for totally
symmetric plane partitions can be written as an explicit product formula, has
been stated independently by George Andrews and David Robbins around 1983. We
present a proof of this long-standing conjecture
- …